Processing cataphors: Active antecedent search is persistent
نویسندگان
چکیده
منابع مشابه
Agrammatism: Structural Deficits and Antecedent Processing Disruptions*
This chapter has three sections. The first provides an examination of the general notion that the brain distinguishes among amodal linguistic components. The second section attempts to support a more specific claim: Namely, that from a linguistic perspective, agrammatism can, best be reconstructed in syntactic terms. And the third section focuses upon processing disruptions in agrammatism-that ...
متن کاملActive search for multiple targets is inefficient
This study examines saccade strategy in a novel task where observers actively search a display to find multiple targets in a limited time. Theory predicts that the relative merit of different saccade strategies depends on the prior probability of the target at a location: when the target prior is low and multiple-target trials are rare, making a saccade to the most likely target location is clo...
متن کاملAttentional modulation: Target selection, active search and cognitive processing
The papers presented in this special issue are based on the Third International Workshop in Visual Attention that took place in October 2011 at the University of Allahabad in India. This is the second of two parts of a special issue on the topic of ‘‘Visual Attention’’. This Editorial highlights the contributions of the papers published in both parts. Part 1 was published in December 2012. The ...
متن کاملWh-filler-gap dependency formation guides reflexive antecedent search
Prior studies on online sentence processing have shown that the parser can resolve non-local dependencies rapidly and accurately. This study investigates the interaction between the processing of two such non-local dependencies: wh-filler-gap dependencies (WhFGD) and reflexive-antecedent dependencies. We show that reflexive-antecedent dependency resolution is sensitive to the presence of a WhFG...
متن کاملPersistent Search Trees
A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly on-line. Several ways of solving this problem in O(log n) query time and O(n) space are known, but they are all rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memory & Cognition
سال: 2021
ISSN: 0090-502X,1532-5946
DOI: 10.3758/s13421-021-01176-z